منابع مشابه
Probabilistic relational categories are learnable as long as you don’t know you’re learning probabilistic relational categories
Kittur, Hummel and Holyoak (2004) showed that people have great difficulty learning relation-based categories with a probabilistic (i.e., family resemblance) structure. We investigated three interventions hypothesized to facilitate learning family-resemblance based relational categories: Naming the relevant relations, providing a hint to look for a family resemblance structure, and changing the...
متن کاملRelational Categories
This chapter is concerned with the acquisition and use of relational categories. By relational category, we mean a category whose membership is determined by a common relational structure rather than by common properties. For instance, for X to be a bridge, X must connect two other entities or points; for X to be a carnivore, X must eat animals. Relational categories contrast with entity catego...
متن کاملCategories of relational structures
The paper characterises compositional homomorphims of relational structures. A detailed study of three categories of such structures { viewed as multialgebras { reveals the one with the most desirable properties. In addition, we study analogous categories with homomorphisms mapping elements to sets (thus being relations). Finally, we indicate some consequences of our results for partial algebra...
متن کاملRunning head: RELATIONAL CATEGORIES ARE MORE MUTABLE 1 Relational Categories Are More Mutable than Entity Categories
Across three experiments, we explore differences between relational categories—whose members share common relational patterns—and entity categories, whose members share common intrinsic properties. Specifically, we test the claim that relational concepts are more semantically mutable in context, and therefore less stable in memory, than entity concepts. We compared memory for entity nouns and r...
متن کاملMaking Probabilistic Relational Categories Learnable
Theories of relational concept acquisition (e.g., schema induction) based on structured intersection discovery predict that relational concepts with a probabilistic (i.e., family resemblance) structure ought to be extremely difficult to learn. We report four experiments testing this prediction by investigating conditions hypothesized to facilitate the learning of such categories. Experiment 1 s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science & Education
سال: 2017
ISSN: 0926-7220,1573-1901
DOI: 10.1007/s11191-017-9928-9